algorithmic algebra

См. также в других словарях:

• Algebra — This article is about the branch of mathematics. For other uses, see Algebra (disambiguation). Algebra is the branch of mathematics concerning the study of the rules of operations and relations, and the constructions and concepts arising from… …   Wikipedia

• List of commutative algebra topics — Commutative algebra is the branch of abstract algebra that studies commutative rings, their ideals, and modules over such rings. Both algebraic geometry and algebraic number theory build on commutative algebra. Prominent examples of commutative… …   Wikipedia

• History of algebra — Elementary algebra is the branch of mathematics that deals with solving for the operands of arithmetic equations. Modern or abstract algebra has its origins as an abstraction of elementary algebra. Historians know that the earliest mathematical… …   Wikipedia

• Bareiss algorithm — In mathematics, the Bareiss algorithm, named after Erwin Bareiss, is an algorithm to calculate the determinant of a matrix with integer entries using only integer arithmetic; any divisions that are performed are guaranteed to be exact (there is… …   Wikipedia

• Heinrich Matzat — Bernd Heinrich Matzat (* 12. Januar 1945 in Treptow an der Rega) ist ein deutscher Mathematiker. Heinrich Matzat, Oberwolfach 2007 Matzat wuchs in Süddeutschland auf und studierte ab 1964 an der Universität Karlsruhe, wo er 1972 bei Heinrich… …   Deutsch Wikipedia

• Lenstra–Lenstra–Lovász lattice basis reduction algorithm — The Lenstra–Lenstra–Lovász lattice basis reduction (LLL) is a polynomial time lattice reduction algorithm invented by Arjen Lenstra, Hendrik Lenstra and László Lovász. Given as input d lattice basis vectors with n dimensional integer coordinates… …   Wikipedia

• Lattice reduction — In mathematics, the goal of lattice basis reduction is given an integer lattice basis as input, to find a basis with short, nearly orthogonal vectors. This is realized using different algorithms, whose running time is usually at least exponential …   Wikipedia

• Heidelberg University Faculty of Mathematics and Computer Science — Infobox University Faculty name = Faculty of Mathematics and Computer Science native name = Fakultät für Mathematik und Informatik established = 2002 dean = Prof. Dr. R. Rannacher staff = 27 students = 1100 website = http://www.math.uni… …   Wikipedia

• Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… …   Wikipedia

• Algorithmische Zahlentheorie — Die algorithmische Zahlentheorie ist ein Teilgebiet der Zahlentheorie, welche wiederum ein Teilgebiet der Mathematik ist. Sie beschäftigt sich mit der Frage nach effizienten algorithmischen Lösungen für zahlentheoretische Fragestellungen.… …   Deutsch Wikipedia

• Mathematical logic — (also known as symbolic logic) is a subfield of mathematics with close connections to foundations of mathematics, theoretical computer science and philosophical logic.[1] The field includes both the mathematical study of logic and the… …   Wikipedia